On a Parameter Estimation Method for Gibbs-Markov Random Fields
نویسندگان
چکیده
Fig. 2. space by Patrick-Fisher's algorithm (solid line) and E (dotted line). Bayes error estimates for SONAR data transformed to IO-dimensional high-dimensional data these results might be more in favor of E.) This is a result of the fact that each iteration of simplex requires that the samples be transformed to the low-dimensional space, and then the Bayes error estimated in that space, which in turn requires computation of distances, determination of optimal thresholds, and classification. The iterative process is repeated until the convergence is achieved. In contrast, FLD and KL are noniterative techniques, which merely compute eigenvalues and eigenvectors of certain matrices. For PF, which is also an iterative algorithm, the difference in CPU timing is about an order of magnitude for SONAR data. The aim of this correspondence was to investigate the possibility of constructing such linear transformation of labeled multidimensional vectors that would hopefully ensure the maximum attainable classification accuracy in the transformed space. In other words, the goal was to come as close as possible to computing a transformation matrix that would minimize the Bayes error in the low-dimensional space, and to devise a practical algorithm for such purpose. The proposed algorithm, called E, consists in finding such matrix that minimizes the estimate of the Bayes error, computed on the training data set projected to the low-dimensional space. The most reliable technique for Bayes error estimation available was used, and the simplex algorithm played the role of the optimization algorithm. In all examples, E demonstrated superior performance in comparison with standard algorithms, coming close to the theoretical limits on classification accuracy. This is payed through significant increase of the computational load. Still we managed to keep its complexity within realistic bounds, thus realizing designated goals. A simplex method for function minimization , " Comput. the probability of misclassification for linear feature selection, " Annals Statist. On the optimal number of features in the classification of multivariate Gaussian data, " Pattern Recogn., vol. Analysis of hidden units in a layered network trained to classify sonar targets, " On the minimal dimension of sufficient statistics, " IEEE Trans. Abstract-This correspondence is about a Gibbs-Markov random field (GMRF) parameter estimation technique proposed by Derin and Elliott. We will refer to this technique as the histogramming (H) method. First, the relation of the H method to the (conditional) maximum likelihood (ML) method is considered. Second, a bias-reduction based modification of …
منابع مشابه
Scalable Data Parallel Algorithms for Texture Synthesis and Compression using Gibbs Random Fields
This paper introduces scalable data parallel algorithms for image processing. Focusing on Gibbs and Markov Random Field model representation for textures, we present parallel algorithms for texture synthesis, compression, and maximum likelihood parameter estimation, currently implemented on Thinking Machines CM-2 and CM-5. Use of ne-grained, data parallel processing techniques yields real-time ...
متن کاملMulti-vector Segmentation of Breast MR Images via Hidden Markov Random Fields
In this paper we apply multi-vector Hidden Markov Random Fields to tissue segmentation of Magnetic Resonance (MR) breast images. Our proposed method performs segmentation using a stack of 3 MR breast slices 1mm apart. The approach takes into account neighborhood voxel information rather than merely neighborhood pixel information and the results are anatomically more plausible in comparison with...
متن کاملBayesian Estimation of Motion Vector Fields
This paper presents a new approach to the estimation of 2-D motion vector fields from time-varying images. The approach is stochastic both in its formulation and in the solution method. The formulation involves the specification of a deterministic structural model along ivith stochastic observation and motion field models. Two motion models are proposed: a globally smooth model based on vector ...
متن کاملGibbs Fields with Multiple Pairwise Pixel Interactions for Texture Simulation and Segmentation
Modelling of spatially homogeneous and piecewise-homogeneous image textures by novel Markov and non-Markov Gibbs random fields with multiple pairwise pixel interactions is briefly overviewed. These models allow for learning both the structure and strengths (Gibbs potentials) of the interactions from a given training sample. The learning is based on first analytic and then stochastic approximati...
متن کاملScalable data parallel algorithms for texture synthesis using Gibbs random fields
This article introduces scalable data parallel algorithms for image processing. Focusing on Gibbs and Markov random field model representation for textures, we present parallel algorithms for texture synthesis, compression, and maximum likelihood parameter estimation, currently implemented on Thinking Machines CM-2 and CM-5. The use of fine-grained, data parallel processing techniques yields re...
متن کاملErratum: Spartan Gibbs Random Field Models for Geostatistical Applications
GEOSTATISTICAL APPLICATIONS Abstract: The inverse problem of determining the spatial dependence of random fields from an experimental sample is a central issue in Geostatistics. We propose a computationally efficient approach based on Spartan Gibbs random fields. Their probability density function is determined by a small set of parameters, which can be estimated by enforcing sample-based const...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Pattern Anal. Mach. Intell.
دوره 16 شماره
صفحات -
تاریخ انتشار 1994